Advanced Topics in Algorithms
نویسندگان
چکیده
[1] David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, and Moti Yung. Corrigendum: Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algorithms, 15(1), 1993. [2] Andrew V. Goldberg and Robert E. Tarjan. Finding minimum-cost circulations by successive approximation. Math. Oper. Res., 15(3):430–466, July 1990. [3] Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup. Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM, 48(4):723–760, 2001.
منابع مشابه
” A Concise and Practical Introduction to Programming Algorithms in Java ” by Frank Nielsen
The book at hand by Frank Nielsen is a textbook mainly targeted to undergraduate students as a very first course in programming. As the title of book says, the programming language used is Java(TM). Following the demands of the targeted audience, the book introduces the topics programming and algorithms without requiring prior knowledge. More advanced topics and concepts such as for example obj...
متن کاملAdvanced Algorithms Lecture Notes
Preface This is a set of lecture notes for the 3rd year course " Advanced Algorithms " which I gave in Tsinghua University for Yao-class students in the Spring and Fall terms in 2011. This set of notes is partially based on the notes scribed by students taking the course the first time it was given. Many thanks to Xiahong Hao and Nathan Hobbs for their hard work in critically revising, editing,...
متن کاملSecurity of Sponge structures
Sponge structure is a structure widely used in the design of cryptographic algorithms that reduces the design of the algorithms to the design of a permutation or pseudo-random function. The development of sponge-based algorithms and the selection of designs based on this structure in SHA3 and CAESAR competitions increase the need to examine its security against various types of attacks. In the ...
متن کاملProof methods and greedy algorithms
This lecture in some ways covers two separate topics: (1) how to prove algorithms correct, in general, using induction; and (2) how to prove greedy algorithms correct. Of course, a thorough understanding of induction is a foundation for the more advanced proof techniques, so the two are related. Note also that even though these techniques are presented more or less as “after the fact” methods o...
متن کاملA Thorough Comparative Analysis of PI and Sliding Mode Controllers in Permanent Magnet Synchronous Motor Drive Based on Optimization Algorithms
In this paper, the speed tracking for permanent magnet synchronous motor (PMSM) in field oriented control (FOC) method is investigated using linear proportional-integral (PI) controller, sliding mode controller (SMC) and its advanced counterparts. The advanced SMCs considered in this paper are fuzzy SMC (FSMC) and sliding mode controller with time-varying switching gain (SMC+TG) which can effec...
متن کاملEngagement in Foundational Computer Science Courses Through Supplementary Content for Algorithms
Engaging students in teaching foundational Computer Science concepts is vital for the student’s continual success in more advanced topics in the field. An idea of a series of Jupyter notebooks was conceived as a way of using Bloom’s Taxonomy to reinforce concepts taught in an introductory algorithms class. ...
متن کامل